Concurrency Control of Large Unstructured Data

نویسندگان

  • Gopi K. Attaluri
  • Jacob Slonim
  • Per-Åke Larson
چکیده

Current research projects and database product extensions re ect the importance of unconventional database applications (for example, document processing and computer aided design). Unconventional applications di er from the conventional ones (for example, airline reservation) in the nature of transactions and data. The transactions may be complex, long and involve human interaction. The data includes small, structured objects as well as large, unstructured objects. The unstructured objects are stored in and managed by unstructured data base management systems (UDS). A UDS employs coarse-granularity locking which limit the concurrency and reduce the throughput of transactions. This paper deals with this problem of coarsegranularity locking at a UDS. It proposes and investigates the logical concurrency control (LCC) concept as a solution. In LCC, a software module sits on top of the UDS and o ers a higher-level service. This module employs application-domain-speci c negranularity locking to achieve high concurrency.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Survey of Concurrency Control Algorithms in the Operating Systems

Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...

متن کامل

A Survey of Concurrency Control Algorithms in the Operating Systems

Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...

متن کامل

Optimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems

In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...

متن کامل

Revisiting Structured Storage: A Transactional Record Store

An increasing number of applications, such as electronic mail servers, web servers, and personal information managers, handle large amounts of homogeneous data. This data can be effectively represented as records and manipulated through simple operations, e.g., record reading, writing, and searching. Unfortunately, modern storage systems are inappropriate for the needs of these applications. On...

متن کامل

On Mining Concurrency Defect-Related Reports from Bug Repositories

We present early findings of two ongoing case studies in which we automatically extract reports about concurrency defects from the MySQL and Apache bug repositories. To mine the unstructured reports, we apply keyword search and machine learning, using linear and non-linear classifiers. We analyze the results in detail and suggest some improvements for this mining task. Automated Bug Report Clas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998